Step of Proof: fincr_formation
12,41
postcript
pdf
Inference at
*
1
1
I
of proof for Lemma
fincr
formation
:
.....aux..... NILNIL
WellFnd{1}(
;
u
,
v
.(
i
,
j
.
i
<
j
)(
u
,
v
))
latex
by ((((RW (RepeatC (UnfoldsC ``wellfounded guard so_apply``) ANDTHENC AbReduceC) 0)
b
CollapseTHEN (D 0))
)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
1.
P
:
C1:
2.
j
:
. (
k
:
. (
k
<
j
)
(
P
(
k
)))
(
P
(
j
))
C1:
3.
n
:
C1:
P
(
n
)
C
.
Definitions
t
T
,
True
,
{
T
}
,
x
(
s
)
,
P
Q
,
,
x
:
A
.
B
(
x
)
,
WellFnd{i}(
A
;
x
,
y
.
R
(
x
;
y
))
,
T
,
Lemmas
nat
wf
origin